Global Clustering Coefficient in Scale-Free Weighted and Unweighted Networks
نویسندگان
چکیده
منابع مشابه
Global Clustering Coefficient in Scale-Free Weighted and Unweighted Networks
In this paper, we present a detailed analysis of the global clustering coefficient in scale-free graphs. Many observed real-world networks of diverse nature have a power-law degree distribution. Moreover, the observed degree distribution usually has an infinite variance. Therefore, we are especially interested in such degree distributions. In addition, we analyze the clustering coefficient for ...
متن کاملSocial triangles and generalized clustering coefficient for weighted networks
In the context of expert systems approach, the problem of community detection can be afford as a clustering model for networks. In this respect, a way to measure the community structure is the clustering coefficient. Such a quantity is based on the number of existing triangles around the nodes over the theoretical ones. To the best of our knowledge, scarce attention has been paid to the fictiti...
متن کاملGeneralizations of the clustering coefficient to weighted complex networks.
The recent high level of interest in weighted complex networks gives rise to a need to develop new measures and to generalize existing ones to take the weights of links into account. Here we focus on various generalizations of the clustering coefficient, which is one of the central characteristics in the complex network theory. We present a comparative study of the several suggestions introduce...
متن کاملThe clustering coefficient of a scale-free random graph
We consider a random graph process in which, at each time step, a new vertex is added with m out-neighbours, chosen with probabilities proportional to their degree plus a strictly positive constant. We show that the expectation of the clustering coefficient of the graph process is asymptotically proportional to log n n . Bollobás and Riordan [3] have previously shown that when the constant is z...
متن کاملSpectra of weighted scale-free networks
Much information about the structure and dynamics of a network is encoded in the eigenvalues of its transition matrix. In this paper, we present a first study on the transition matrix of a family of weight driven networks, whose degree, strength, and edge weight obey power-law distributions, as observed in diverse real networks. We analytically obtain all the eigenvalues, as well as their multi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Internet Mathematics
سال: 2015
ISSN: 1542-7951,1944-9488
DOI: 10.1080/15427951.2015.1092482